home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Atari Mega Archive 1
/
Atari Mega Archive - Volume 1.iso
/
archiver
/
unix
/
zip19p1.zoo
/
zipsplit.c
< prev
next >
Wrap
C/C++ Source or Header
|
1992-08-20
|
17KB
|
583 lines
/*
Copyright (C) 1990-1992 Mark Adler, Richard B. Wales, Jean-loup Gailly,
Kai Uwe Rommel and Igor Mandrichenko.
Permission is granted to any individual or institution to use, copy, or
redistribute this software so long as all of the original files are included
unmodified, that it is not sold for profit, and that this copyright notice
is retained.
*/
/*
* zipsplit.c by Mark Adler.
*/
#define UTIL
#include "revision.h"
#include "zip.h"
#include <signal.h>
#define DEFSIZ 36000L /* Default split size (change in help() too) */
#ifdef MSDOS
# define NL 2 /* Number of bytes written for a \n */
#else /* !MSDOS */
# define NL 1 /* Number of bytes written for a \n */
#endif /* ?MSDOS */
#define INDEX "zipsplit.idx" /* Name of index file */
/* Local functions */
#ifdef PROTO
local void handler(int);
local void license(void);
local void help(void);
local extent simple(ulg *, extent, ulg, ulg);
local int descmp(voidp *, voidp *);
local extent greedy(ulg *, extent, ulg, ulg);
void main(int, char **);
#endif /* PROTO */
/* Output zip files */
local char template[16]; /* name template for output files */
local int zipsmade = 0; /* number of zip files made */
local int indexmade = 0; /* true if index file made */
local char *path = NULL; /* space for full name */
local char *name; /* where name goes in path[] */
void err(c, h)
int c; /* error code from the ZE_ class */
char *h; /* message about how it happened */
/* Issue a message for the error, clean up files and memory, and exit. */
{
if (PERR(c))
perror("zipsplit error");
fprintf(stderr, "zipsplit error: %s (%s)\n", errors[c-1], h);
if (indexmade)
{
strcpy(name, INDEX);
destroy(path);
}
for (; zipsmade; zipsmade--)
{
sprintf(name, template, zipsmade);
destroy(path);
}
if (path != NULL)
free((voidp *)path);
if (zipfile != NULL)
free((voidp *)zipfile);
#ifdef VMS
exit(0);
#else /* !VMS */
exit(c);
#endif /* ?VMS */
}
local void handler(s)
int s; /* signal number (ignored) */
/* Upon getting a user interrupt, abort cleanly using err(). */
{
#ifndef MSDOS
putc('\n', stderr);
#endif /* !MSDOS */
err(ZE_ABORT, "aborting");
s++; /* keep some compilers happy */
}
void warn(a, b)
char *a, *b; /* message strings juxtaposed in output */
/* Print a warning message to stderr and return. */
{
fprintf(stderr, "zipsplit warning: %s%s\n", a, b);
}
local void license()
/* Print license information to stdout. */
{
extent i; /* counter for copyright array */
for (i = 0; i < sizeof(copyright)/sizeof(char *); i++) {
printf(copyright[i], "zipsplit");
putchar('\n');
}
for (i = 0; i < sizeof(disclaimer)/sizeof(char *); i++)
puts(disclaimer[i]);
}
local void help()
/* Print help (along with license info) to stdout. */
{
extent i; /* counter for help array */
/* help array */
static char *text[] = {
"",
"ZipSplit %d.%d (%s)",
"Usage: zipsplit [-ti] [-n size] [-b path] zipfile",
" -t report how many files it will take, but don't make them",
" -i make index (zipsplit.idx) and count its size against first zip file",
" -n make zip files no larger than \"size\" (default = 36000)",
" -b use \"path\" for the output zip files",
" -s do a sequential split even if it takes more zip files",
" -h show this help -L show software license"
};
for (i = 0; i < sizeof(copyright)/sizeof(char *); i++) {
printf(copyright[i], "zipsplit");
putchar('\n');
}
for (i = 0; i < sizeof(text)/sizeof(char *); i++)
{
printf(text[i], REVISION / 10, REVISION % 10, REVDATE);
putchar('\n');
}
}
local extent simple(a, n, c, d)
ulg *a; /* items to put in bins, return value: destination bins */
extent n; /* number of items */
ulg c; /* capacity of each bin */
ulg d; /* amount to deduct from first bin */
/* Return the number of bins of capacity c that are needed to contain the
integers in a[0..n-1] placed sequentially into the bins. The value d
is deducted initially from the first bin (space for index). The entries
in a[] are replaced by the destination bins. */
{
extent k; /* current bin number */
ulg t; /* space used in current bin */
t = k = 0;
while (n--)
{
if (*a + t > c - (k == 0 ? d : 0))
{
k++;
t = 0;
}
t += *a;
*(ulg huge *)a++ = k;
}
return k + 1;
}
local int descmp(a, b)
voidp *a, *b; /* pointers to pointers to ulg's to compare */
/* Used by qsort() in greedy() to do a descending sort. */
{
return **(ulg **)a < **(ulg **)b ? 1 : (**(ulg **)a > **(ulg **)b ? -1 : 0);
}
local extent greedy(a, n, c, d)
ulg *a; /* items to put in bins, return value: destination bins */
extent n; /* number of items */
ulg c; /* capacity of each bin */
ulg d; /* amount to deduct from first bin */
/* Return the number of bins of capacity c that are needed to contain the
items with sizes a[0..n-1] placed non-sequentially into the bins. The
value d is deducted initially from the first bin (space for index).
The entries in a[] are replaced by the destination bins. */
{
ulg *b; /* space left in each bin (malloc'ed for each m) */
ulg *e; /* copy of argument a[] (malloc'ed) */
extent i; /* steps through items */
extent j; /* steps through bins */
extent k; /* best bin to put current item in */
extent m; /* current number of bins */
ulg **s; /* pointers to e[], sorted descending (malloc'ed) */
ulg t; /* space left in best bin (index k) */
/* Algorithm:
1. Copy a[] to e[] and sort pointers to e[0..n-1] (in s[]), in
descending order.
2. Compute total of s[] and set m to the smallest number of bins of
capacity c that can hold the total.
3. Allocate m bins.
4. For each item in s[], starting with the largest, put it in the
bin with the smallest current capacity greater than or equal to the
item's size. If no bin has enough room, increment m and go to step 4.
5. Else, all items ended up in a bin--return m.
*/
/* Copy a[] to e[], put pointers to e[] in s[], and sort s[]. Also compute
the initial number of bins (minus 1). */
if ((e = (ulg *)malloc(n * sizeof(ulg))) == NULL ||
(s = (ulg **)malloc(n * sizeof(ulg *))) == NULL)
{
if (e != NULL)
free((voidp *)e);
err(ZE_MEM, "was trying a smart split");
return 0; /* only to make compiler happy */
}
memcpy((char *)e, (char *)a, n * sizeof(ulg));
for (t = i = 0; i < n; i++)
t += *(s[i] = e + i);
m = (extent)((t + c - 1) / c) - 1; /* pre-decrement for loop */
qsort((char *)s, n, sizeof(ulg *), descmp);
/* Stuff bins until successful */
do {
/* Increment the number of bins, allocate and initialize bins */
if ((b = (ulg *)malloc(++m * sizeof(ulg))) == NULL)
{
free((voidp *)s);
free((voidp *)e);
err(ZE_MEM, "was trying a smart split");
}
b[0] = c - d; /* leave space in first bin */
for (j = 1; j < m; j++)
b[j] = c;
/* Fill the bins greedily */
for (i = 0; i < n; i++)
{
/* Find smallest bin that will hold item i (size s[i]) */
t = c + 1;
for (k = j = 0; j < m; j++)
if (*s[i] <= b[j] && b[j] < t)
t = b[k = j];
/* If no bins big enough for *s[i], try next m */
if (t == c + 1)
break;
/* Diminish that bin and save where it goes */
b[k] -= *s[i];
a[(int)((ulg huge *)(s[i]) - (ulg huge *)e)] = k;
}
/* Clean up */
free((voidp *)b);
/* Do until all items put in a bin */
} while (i < n);
/* Done--clean up and return the number of bins needed */
free((voidp *)s);
free((voidp *)e);
return m;
}
void main(argc, argv)
int argc; /* number of tokens in command line */
char **argv; /* command line tokens */
/* Split a zip